Study on improvement of conductivity of Cu-Cr-Zr alloys

The influence of alloying, heat treatment, and plastic working on the performance of Cu-Cr-Zr alloys was investigated. The precipitated phases were characterized as Cr, Cu51Zr14 and Cu5Zr. Cu-Cr-Zr alloys demonstrate combination properties of high strength and high conductivity after solution treatment, aging treatment, and plastic deformation. Precipitation course of Cr is the main factor that influences the conductivity of Cu-Cr-Zr alloys, while adding Zr in the alloys adjusts the orientation relationship between Cr and matrix, and tends to increase the conductivity of aged Cu-Cr-Zr alloys after deformation.     

直线共轭内啮合齿轮泵齿圈强度分析

对直线共轭内啮合齿轮泵齿圈强度进行了研究,分析了工作状态的几何约束,计算了啮合力和内外侧的径向油压分布,使用有限元分析软件ANSYS得到的结果显示,作用在齿圈内侧的高压油对齿圈的弯曲作用会在齿根部产生较大的应力,这是导致齿圈失效的重要原因.     

液体静压导轨支承油膜的有限元分析

介绍了液体静压导轨支承的设计,并对其油膜压力分布进行了研究.根据流体润滑理论及雷诺方程,构建了导轨油膜压力的数学物理模型,提出了运用有限元法进行油膜刚度及导轨承载能力的分析与计算方法.借助非线性有限元软件Marc对一个应用实例进行了分析与计算,得到油膜压力的分布云图和曲线,求解出了油膜刚度和导轨的承载能力.计算结果表明,该方法计算结果精确,可以满足设计要求.     

DPA:一种动态环境下QoS单播路由算法

目前Internet网络环境下,网络参数的随时变化容易造成路由过期,从而使提供的QoS路由无效,为此提出了一种适合参数动态变化的单播QoS路由算法(DPA),该算法在路径代价随时间不断变化的情况下能够自主地选择最优路由节点,解决多约束QoS单播路由选择不精确的问题.实验表明,本路由算法自适应性和扩展性较好,同时在路由选择方面比传统的路由算法能够提供更好的QoS路由.     

Robust image hashing using non-uniform sampling in discrete Fourier domain

This paper proposes a robust image hashing method in discrete Fourier domain that can be applied in such fields as image authentication and retrieval. In the pre-processing stage, image resizing and total variation based filtering are first used to regularize the input image. Then the secondary image is obtained by the rotation projection, and the robust frequency feature is extracted from the secondary image after discrete Fourier transform. More sampling points are chosen from the low- and middle-frequency component to represent the salient content of the image effectively, which is achieved by the non-uniform sampling. Finally, the intermediate sampling feature vectors are scrambled and quantized to produce the resulting binary hash securely. The security of the method depends entirely on the secret key. Experiments are conducted to show that the present method has satisfactory robustness against perceptual content-preserving manipulations and has also very low probability for collision of the hashes of distinct images.     

Peri-Watchdog: Hunting for hidden botnets in the periphery of online social networks

In order to evade detection of ever-improving defense techniques, modern botnet masters are constantly looking for new communication platforms for delivering C&C (Command and Control) information. Attracting their attention is the emergence of online social networks such as Twitter, as the information dissemination mechanism provided by these networks can naturally be exploited for spreading botnet C&C information, and the enormous amount of normal communications co-existing in these networks makes it a daunting task to tease out botnet C&C messages.Against this backdrop, we explore graph-theoretic techniques that aid effective monitoring of potential botnet activities in large open online social networks. Our work is based on extensive analysis of a Twitter dataset that contains more than 40 million users and 1.4 billion following relationships, and mine patterns from the Twitter network structure that can be leveraged for improving efficiency of botnet monitoring. Our analysis reveals that the static Twitter topology contains a small-sized core sugraph, after removing which, the Twitter network breaks down into small connected components, each of which can be handily monitored for potential botnet activities. Based on this observation, we propose a method called Peri-Watchdog, which computes the core of a large online social network and derives the set of nodes that are likely to pass botnet C&C information in the periphery of online social network. We analyze the time complexity of Peri-Watchdog under its normal operations. We further apply Peri-Watchdog on the Twitter graph injected with synthetic botnet structures and investigate the effectiveness of Peri-Watchdog in detecting potential C&C information from these botnets.To verify whether patterns observed from the static Twitter graph are common to other online social networks, we analyze another online social network dataset, BrightKite, which contains evolution of social graphs formed by its users in half a year. We show not only that there exists a similarly relatively small core in the BrightKite network, but also this core remains stable over the course of BrightKite evolution. We also find that to accommodate the dynamic growth of BrightKite, the core has to be updated about every 18 days under a constrained monitoring capacity.     

求解泊松方程的紧致修正法

将紧致格式与低阶格式结合,构造紧致格式的修正项,并将修正项加入到源项中进行求解,得到了一种基于非均分网格求解泊松方程的紧致修正法,且将该方法应用于二维和三维泊松方程的数值求解中。数值计算结果表明:紧致修正方法的精度高于经典方法的精度,但四阶紧致修正方法比二阶经典方法对网格的依赖性强。